The one-dimensional cutting stock problem with sequence-dependent cut losses

An ACO algorithm for one-dimensional cutting stock problem

The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...

One-dimensional Cutting Stock Problem with Divisible Items

This paper considers the one-dimensional cutting stock problem with divisible items, which is a new problem in the cutting stock literature. The problem exists in steel industries. In the new problem, each item can be divided into smaller pieces, then they can be recombined again by welding. The objective is to minimize both the trim loss and the number of the welds. We present a mathematical m...

an aco algorithm for one-dimensional cutting stock problem

the one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. in this paper a meta-heuristic method based on aco is presented to solve this problem. in this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...

Solving an one-dimensional cutting stock problem by simulated annealing and tabu search

A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...

Solving the General One-Dimensional Cutting Stock Problem with a Cutting Plane Approach